منابع مشابه
PC trees and circular-ones arrangements
A 0-1 matrix has the consecutive-ones property if its columns can be ordered so that the ones in every row are consecutive. It has the circular-ones property if its columns can be ordered so that, in every row, either the ones or the zeros are consecutive. PQ trees are used for representing all consecutive-ones orderings of the columns of a matrix that has the consecutive-ones property. We give...
متن کاملPC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent partial embeddings of planar graphs. PQ-trees were invented by Booth and Lueker [1] to test the consecutive ones property in matrices. The original implementation of the PQ-tree algorithms by Booth and Lueker using nine t...
متن کاملHyperplane arrangements, interval orders, and trees.
A hyperplane arrangement is a finite set of hyperplanes in a real affine space. An especially important arrangement is the braid arrangement, which is the set of all hyperplanes xi - xj = 1, 1 </= i < j </= n, in Rn. Some combinatorial properties of certain deformations of the braid arrangement are surveyed. In particular, there are unexpected connections with the theory of interval orders and ...
متن کاملA New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying special values of these polynomials, we derive periodicity and parity theorems for this statistic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00435-8